Community Detection Fusing Graph Attention Network
نویسندگان
چکیده
It has become a tendency to use combination of autoencoders and graph neural networks for attribute clustering solve the community detection problem. However, existing methods do not consider influence differences between node neighborhood information high-order information, fusion structural features is insufficient. In order make better we propose model named fusing attention network (CDFG). Specifically, firstly an autoencoder learn features. Then only calculates weight on target but also adds After that, two are initially fused by balance parameter. The feature module extracts hidden layer representation calculate self-correlation matrix, which multiplied obtained preliminary achieve secondary fusion. Finally, self-supervision mechanism makes it face task. Experiments conducted six real datasets. Using four evaluation metrics, CDFG performs most datasets, especially with longer average paths diameters smaller coefficients.
منابع مشابه
Spectral methods for network community detection and graph partitioning
We consider three distinct and well studied problems concerning network structure: community detection by modularity maximization, community detection by statistical inference, and normalized-cut graph partitioning. Each of these problems can be tackled using spectral algorithms that make use of the eigenvectors of matrix representations of the network. We show that with certain choices of the ...
متن کاملCommunity detection and graph partitioning
Many methods have been proposed for community detection in networks. Some of the most promising are methods based on statistical inference, which rest on solid mathematical foundations and return excellent results in practice. In this paper we show that two of the most widely used inference methods can be mapped directly onto versions of the standard minimum-cut graph partitioning problem, whic...
متن کاملGeneralized network community detection
Community structure is largely regarded as an intrinsic property of complex real-world networks. However, recent studies reveal that networks comprise even more sophisticated modules than classical cohesive communities. More precisely, real-world networks can also be naturally partitioned according to common patterns of connections between the nodes. Recently, a propagation based algorithm has ...
متن کاملLocally Boosted Graph Aggregation for Community Detection
Learning the right graph representation from noisy, multi-source data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Here the objective is to incorporate the partial information each data source gives us in a way that captures the true underlying relationships. To address this challenge, we present a general, boosting-inspired framewor...
متن کاملCommunity Detection in Networks using Graph Distance
The study of networks has received increased attention recently not only from the social sciences and statistics but also from physicists, computer scientists and mathematicians. One of the principal problem in networks is community detection. Many algorithms have been proposed for community finding [37] [44] but most of them do not have have theoretical guarantee for sparse networks and networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10214155